Unordered Tuples in Quantum Computation
نویسندگان
چکیده
منابع مشابه
Unordered Tuples in Quantum Computation
It is well known that the C∗-algebra of an ordered pair of qubits is M2⊗M2. What about unordered pairs? We show in detail that M3⊕C is the C∗-algebra of an unordered pair of qubits. Then we use Schur-Weyl duality to characterize the C∗-algebra of an unordered n-tuple of d-level quantum systems. Using some further elementary representation theory and number theory, we characterize the quantum cy...
متن کاملOn Polynomial Time Computation over Unordered Structures
This paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity classes contained in polynomial time. We show that fixpoint logic plus counting is stronger than might be expected, in that it can express the existence of a compl...
متن کاملQuantum discord in quantum computation
Quantum discord is a measure of the quantumness of correlations. After reviewing its different versions and properties, we apply it to the questions of quantum information processing. First we show that changes in discord in the processed unentangled states indicate the need for entanglement in the distributed implementation of quantum gates. On the other hand, it was shown that zero system-env...
متن کاملQuantum Dot Quantum Computation
Within the last few years, quantum computation has developed into a truly interdisciplinary field involving the contributions of physicists, engineers, and computer scientists. There have been several experimental studies in order to find the proper physical realization of qubits to perform quantum computation. One of the most promising candidates for qubits is the spin state of the electrons, ...
متن کاملUniversality in Quantum Computation
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates. To be published in Proc.R.Soc.London A, June 1995.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2015
ISSN: 2075-2180
DOI: 10.4204/eptcs.195.15